Büchi Complementation
نویسنده
چکیده
This entry provides a verified implementation of rank-based Büchi Complementation [1]. The verification is done in three steps: 1. Definition of odd rankings and proof that an automaton rejects a word iff there exists an odd ranking for it. 2. Definition of the complement automaton and proof that it accepts exactly those words for which there is an odd ranking. 3. Verified implementation of the complement automaton using the Isabelle Collections Framework.
منابع مشابه
Complementation Constructions for Nondeterministic Automata on Infinite Words
The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis tech...
متن کاملBüchi Complementation Made Tight
The precise complexity of complementing Büchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple – it suffices to determinize them using a simple subset construction and to dualize the acceptance condition of the resulting automaton – Büchi complementation is more involved. Indeed, the construction of an EXPTIME complemen...
متن کاملTight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
Generalised Büchi automata are Büchi automata with multiple accepting sets. They form a class of automata that naturally occurs, e.g., in the translation from LTL to ω-automata. In this paper, we extend current determinisation techniques for Büchi automata to generalised Büchi automata and prove that our determinisation is optimal. We show how our optimal determinisation technique can be used a...
متن کاملLower Bounds for Complementation of ω-Automata via the Full Automata Technique
In this paper, we first introduce a new lower bound technique for the state complexity of transformations of automata. Namely we suggest considering the class of full automata in lower bound analysis. Then we apply such technique to the complementation of nondeterministic ωautomata and obtain several lower bound results. Particularly, we prove anΩ((0.76n)) lower bound for Büchi complementation,...
متن کاملImproved Ramsey-Based Büchi Complementation
We consider complementing Büchi automata by applying the Ramsey-based approach, which is the original approach already used by Büchi and later improved by Sistla et al. We present several heuristics to reduce the state space of the resulting complement automaton and provide experimental data that shows that our improved construction can compete (in terms of finished complementation tasks) also ...
متن کاملOn Minimal Odd Rankings for Büchi Complementation
We study minimal odd rankings (as defined by Kupferman and Vardi[KV01]) for run-DAGs of words in the complement of a nondeterministic Büchi automaton. We present an optimized version of the ranking based complementation construction of Friedgut, Kupferman and Vardi [FKV06] and Schewe’s[Sch09] variant of it, such that every accepting run of the complement automaton assigns a minimal odd ranking ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017